Combining Strict and Soft Typing in Functional Programming
نویسندگان
چکیده
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept every well-typed program. The main component of a complete type checker is defined.
منابع مشابه
How to Combine the Benefits of Strict and Soft Typing
We discuss the properties of strictly typed languages on the one hand and soft typing on the other one and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of both strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept e...
متن کاملUsing a Functional Language for Parsing and Semantic Processing
This paper shows how a non-strict functional programming language with polymorphic typing can be used to deene grammar rules and semantic evaluation along the lines of Montague. This approach provides a uniied formalism needing no preprocessing or postprocessing to the functional language itself: parsing and semantics are declared naturally using function deenition and evaluation is done by lam...
متن کاملUniqueness Typing in Theory and Practice
We present uniqueness typing as an extension of a familiar Curry style typing system for graph rewrite systems. This provides a method for combining purely functional programming with operations having side-eeects, while preserving the functional nature of the language. We give a technical account as well as the underlying intuition. The system is shown to be eeective in the sense that a unique...
متن کاملDelphin: Functional Programming with Deductive Systems
We present the design and implementation of the strict and pure functional programming language Delphin. Its novel and distinctive features include a two-level design that distinguishes cleanly between the tasks of representing data and programming with data. One level is the logical framework LF [5], serving as Delphin’s data representation language. The other level is T + ω [15], a type theor...
متن کاملCollected Size Semantics for Strict Functional Programs over General Polymorphic Lists
Size analysis can be an important part of heap consumption analysis. This paper is a part of ongoing work about typing support for checking output-on-input size dependencies for function definitions in a strict functional language. A significant restriction for our earlier results is that inner data structures (e.g. in a list of lists) all must have the same size. Here, we make a big step forwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999